Application of Improved Discrete Particle Swarm Optimization in Logistics Distribution Routing Problem
نویسندگان
چکیده
منابع مشابه
An Improved Particle Swarm Optimization for Vehicle Routing Problem
Vehicle routing problem is a NP-hard problem in combination optimization problem, It is influenced by many factors, and the process is complex. However, the search space of particle swarm algorithm is limited and prone to precocious phenomenon. In this paper, we based on the original particle swarm optimization, present a new way of location update algorithm (VPSO).VPSO in the process of solvin...
متن کاملAn Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems
Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...
متن کاملA particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation
In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...
متن کاملElectromagnet Shape Optimization using Improved Discrete Particle Swarm Optimization (IDPSO)
The magnetic field gradient produced by an electromagnet gripper head depends on its design. Stochastic Methods offer certain robustness to the design optimization process. In this paper, Improved Discrete Particle Swarm Optimization (IDPSO) searching technique is applied to the shape and magnetic field gradient optimization of an electromagnet head. The magnetic field and forces are computed u...
متن کاملMulti-State Particle Swarm Optimization for Discrete Combinatorial Optimization Problem
The binary-based algorithms including the binary particle swarm optimization (BPSO) algorithm are proposed to solve discrete optimization problems. Many works have focused on the improvement of the binary-based algorithms. Yet, none of these works have been represented in states. In this paper, by implementing the representation of state in particle swarm optimization (PSO), a variant of PSO ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Engineering
سال: 2011
ISSN: 1877-7058
DOI: 10.1016/j.proeng.2011.08.688